Multiprocessor Semi-fixed-priority Scheduling
نویسندگان
چکیده
منابع مشابه
Fixed-Priority Multiprocessor Scheduling: Beyond Liu & Layland Utilization Bound
The increasing interests in multicores raise the question whether established results on uniprocessor scheduling, in particular, the various utilization bounds for schedulability test used in system design, can be generalized to the multiprocessor setting. Recently, this has been shown for the famous Liu and Layland utilization bound by applying novel task splitting techniques. However, paramet...
متن کاملFixed-Priority Scheduling of Periodic Tasks on Multiprocessor Systems
Consider the problem of periodic task scheduling, in which we seek to minimize the total number of processors required to execute a set of tasks such that task deadlines are guaranteed by the Rate-Monotonic (or RM) algorithm on each processor. This problem was rst investigated by Dhall and Liu, and the previous lowest bound for the problem was 2.0. In this paper, an improved solution is given b...
متن کاملFixed-Priority Multiprocessor Scheduling with Liu & Layland’s Utilization Bound
Liu and Layland discovered the famous utilization bound N(2 1 N − 1) for fixed-priority scheduling on singleprocessor systems in the 1970’s. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and...
متن کاملFixed Priority Scheduling
Outline 1 Fixed priority 2 Priority assignment 3 Scheduling analysis 4 A necessary and sufficient test 5 Sensitivity 6 Hyperplane analysis 7 Conclusions 8 Esercizi Calcolo del tempo di risposta Calcolo del tempo di risposta con aperiodici Hyperplane analysis
متن کاملA Hybrid Priority Multiprocessor Scheduling Algorithm
We propose a hybrid scheduling algorithm using deferred preemption with an online adjustment. Our approach is to prevent jobs from preempting one another until they have been promoted. We use the tasks’ Worst Case Response Time (WCRT) to determine when a promotion must occur in order to ensure safe execution. During execution, this promotion time is adjusted to extend nonpreemptive execution of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2018
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.26.202